Models and theories of λ-calculus

نویسنده

  • Giulio Manzonetto
چکیده

In this paper we briefly summarize the contents of Manzonetto’s PhD thesis [35] which concerns denotational semantics and equational/order theories of the pure untyped λ-calculus. The main research achievements include: (i) a general construction of λ-models from reflexive objects in (possibly non-well-pointed) categories; (ii) a Stonestyle representation theorem for combinatory algebras; (iii) a proof that no effective λ-model can have λβ or λβη as its equational theory (this can be seen as a partial answer to an open problem introduced by HonsellRonchi Della Rocca in 1984). These results, and others, have been published in three conference papers [36, 10, 15] and a journal paper [37]; a further journal paper has been submitted [9].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lambda Calculus: Models and Theories

In this paper we give an outline of recent results concerning theories and models of the untyped lambda calculus. Algebraic and topological methods have been applied to study the structure of the lattice of λ-theories, the equational incompleteness of lambda calculus semantics, and the λ-theories induced by graph models of lambda calculus.

متن کامل

Effective λ-models versus recursively enumerable λ-theories

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

متن کامل

Effective lambda-models vs recursively enumerable lambda-theories

A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ . In this paper we investigate the more general question of whether the equational/order theory of a model of the untyped λ-calculus can be recursively enumerable (r.e. for brevity). We introduce a notion of effective model of λ-calculus, which cove...

متن کامل

Applying Universal Algebra to Lambda Calculus

The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untyped λ-calculus) and the models of lambda calculus via universal algebra. This includes positive or negative answers to several questions raised in these years as well as several independent results, the state of the art ...

متن کامل

Graph Lambda Theories † a N T O N I O B U C C I a R E L L I and a N T O N I N O S a L I B R A

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the λβ or the least sensible λ-theory H (generated by equating all the unsolvable terms). A related question is whether, given a class of lambda models, there are a minimal λ-theory and a minimal sensible λ-theory represented by it. In this paper, we giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008